Shortest path problem - PDFSEARCH.IO - Document Search Engine

Shortest path problem
Results: 829

#	Item
231	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Computing the Geodesic Centers of a Polygonal Domain∗ Sang Won Bae† Matias Korman‡,§ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-18 23:00:30 Simple polygon Distance Shortest path problem Geometry Mathematics Theoretical computer science Geodesic
232	CS 373: Combinatorial Algorithms, Spring 2001 http://www-courses.cs.uiuc.edu/~cs373 Homework 6 (due Tue. May 1, 2001 at 11:59.99 p.m.) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:35 NP-complete problems Complexity classes NP-complete NP-hard NP Travelling salesman problem Vertex cover Maximum cut Shortest path problem Theoretical computer science Computational complexity theory Mathematics
233	An O(ND) Difference Algorithm and Its Variations∗ EUGENE W. MYERS Department of Computer Science, University of Arizona, Tucson, AZ 85721, U.S.A. ABSTRACT Add to Reading List Source URL: xmailserver.org Language: English - Date: 2007-02-16 03:04:45 Operations research NP-complete problems Dynamic programming Equations Systems engineering Shortest path problem Longest common subsequence problem Graph Catalan number Mathematics Theoretical computer science Graph theory
234	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Minimizing the endpoint trace length of rod motions amidst polygonal obstacles is NP-hard Extended Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:37 Applied mathematics Optical devices Network theory NP Shortest path problem Beam splitter Theoretical computer science Computational complexity theory Complexity classes
235	Distance Preserving Terrain Simplification — An Experimental Study Boaz Ben-Moshe1 Matthew J. Katz2 Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:06 Geometry Delaunay triangulation Distance Geometric spanner Geodesic Shortest path problem Mathematics Triangulation Graph theory
236	Subcubic Equivalences Between Path, Matrix, and Triangle Problems∗ Virginia Vassilevska Williams† Ryan Williams‡ Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2010-07-02 00:47:48 Matrix theory Numerical linear algebra Matrix Shortest path problem Floyd–Warshall algorithm Randomized algorithm Mathematics Algebra Linear algebra
237	CS 373 Midterm 2 (April 3, 2001) Spring 2001 Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:35 Network theory Adjacency matrix Algebraic graph theory Matrices Graph Adjacency list Shortest path problem Algorithm Connectivity Graph theory Mathematics Theoretical computer science
238	Diverse and Additive Cartesian Abstraction Heuristics Jendrik Seipp and Malte Helmert Universit¨at Basel Basel, Switzerland {jendrik.seipp,malte.helmert}@unibas.ch Add to Reading List Source URL: ai.cs.unibas.ch Language: English - Date: 2014-03-07 08:16:24 Theoretical computer science Heuristic function Admissible heuristic Heuristic Abstraction Consistent heuristic Mathematical optimization Algorithm Shortest path problem Heuristics Mathematics Applied mathematics
239	Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth Add to Reading List Source URL: jair.org Language: English - Date: 2012-03-19 16:09:33 Tree decomposition Interval graph Floyd–Warshall algorithm Neighbourhood Clique Split graph Shortest path problem Path decomposition Degeneracy Graph theory Graph operations Chordal graph
240	Computing the Shortest Path: A∗ Search Meets Graph Theory Andrew V. Goldberg∗ Abstract We propose shortest path algorithms that use A∗ search in combination with a new graph-theoretic lower-bounding technique based Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2011-10-12 13:22:52 Search algorithms Routing algorithms Network theory Shortest path problem Breadth-first search Distance Connected component Graph Algorithm Mathematics Graph theory Theoretical computer science

UPDATE